Prediction-Preserving Reducibility with Membership Queries on Formal Languages
نویسندگان
چکیده
This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular pattern languages. For the former, we mainly show that DNF formulas are pwm-reducible to CFGs that is sequential or that contains at most one nonterminal. For the latter, we show that both bounded finite unions of regular pattern languages and unbounded finite unions of substring pattern languages are pwm-reducible to DFAs.
منابع مشابه
A Catalog for Prediction-Preserving Reducibility with Membership Queries on Formal Languages
This paper presents several results of prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages. We mainly deal with two kinds of concept classes, simple CFGs and finite unions of regular pattern languages. For the former, we show that DNF formulas are pwm-reducible to CFGs that is sequential or that contains at most one nonterminal. For the latter, on t...
متن کاملSparse Variations and Reducibility among Prediction Problems Authors :
We investigate the relationship between two di erent notions of reducibility among prediction (learning) problems within the distribution-free learning model of Valiant (PAC learning model [7, 2].) The notions of reducibility we consider are the analogues for prediction problems of the many-one reducibility and of the Turing reducibility. The former is the notion of prediction preserving reduci...
متن کاملReductions among prediction problems: on the difficulty of predicting automata
Consider the following question: Given examples of words accepted and rejected by an unknown automaton, is there an algorithm that in a feasible amount of time will learn to predict which words will be accepted by the automaton? We develop a notion of prediction-preserving reducibility, and show that if DFAs are predictable, then so are all languages in logspace. In particular, the predictabili...
متن کاملA Note on the Power of Extra Queries to Membership Comparable Sets
A language is called k-membership comparable if there exists a polynomial-time algorithm that excludes for any k words one of the 2 possibilities for their characteristic string. It is known that all membership comparable languages can be reduced to some P-selective language with polynomially many adaptive queries. We show however that for all k there exists a (k + 1)-membership comparable set ...
متن کاملVerifiable Member and Order Queries on a List in Zero-Knowledge
We introduce a formal model for order queries on lists in zero knowledge in the traditional authenticated data structure model. We call this model Privacy-Preserving Authenticated List (PPAL). In this model, the queries are performed on the list stored in the (untrusted) cloud where data integrity and privacy have to be maintained. To realize an efficient authenticated data structure, we first ...
متن کامل